Proving Serre’s modularity conjecture via Sophie Germain primes
نویسنده
چکیده
In this article we give a proof of Serre’s conjecture for the cases of odd conductor and even conductor semistable at 2, and arbitrary weight. Our proof in both cases will be unconditional: in particular, it will not depend on any yet unproved generalization of Kisin’s modularity lifting results to characteristic 2 (moreover, we will not consider at all characteristic 2 representations in any step of our proof). The new key ingredient is the use of Sophie Germain primes to perform an efficient weight reduction (“Sophie Germain’s weight reduction”), which is combined with the methods and results of previous articles on Serre’s conjecture by Khare, Wintenberger, and myself. To conclude we present a second (simpler) proof which avoids the use of Khare’s weight reduction (thus, we give in particular an alternative proof of the level 1 case).
منابع مشابه
The power digraphs of safe primes
A power digraph, denoted by $G(n,k)$, is a directed graph with $Z_{n}={0,1,..., n-1}$ as the set of vertices and $L={(x,y):x^{k}equiv y~(bmod , n)}$ as the edge set, where $n$ and $k$ are any positive integers. In this paper, the structure of $G(2q+1,k)$, where $q$ is a Sophie Germain prime is investigated. The primality tests for the integers of the form $n=2q+1$ are established in terms of th...
متن کاملRemarks on Serre’s modularity conjecture
In this article we give a proof of Serre’s conjecture for the case of odd level and arbitrary weight. Our proof will not depend on any yet unproved generalization of Kisin’s modularity lifting results to characteristic 2 (moreover, we will not consider at all characteristic 2 representations in any step of our proof). The key tool in the proof is Kisin’s recent modularity lifting result, which ...
متن کاملLarge Sophie Germain primes
If P is a prime and 2P+1 is also prime, then P is a Sophie Germain prime. In this article several new Sophie Germain primes are reported, which are the largest known at this time. The search method and the expected search times are discussed.
متن کاملLargest known twin primes and Sophie Germain primes
The numbers 242206083 · 238880 ± 1 are twin primes. The number p = 2375063906985 · 219380 − 1 is a Sophie Germain prime, i.e. p and 2p + 1 are both primes. For p = 4610194180515 · 25056 − 1, the numbers p, p + 2 and 2p + 1 are all primes. In the first days of October, 1995, Harvey Dubner [4] found the largest known twin primes with 5129 decimal digits. (Our earlier twin prime record was 6970538...
متن کاملOn the modularity of rigid Calabi-Yau threefolds: Epilogue
In a recent preprint of F. Gouvea and N. Yui (see arxiv.org/abs/0902.1466) a detailed account is given of a patching argument due to Serre that proves that the modularity of all rigid Calabi-Yau threefolds defined over Q follows from Serre’s modularity conjecture. In this note (a letter to N. Yui) we give an alternative proof of this implication. The main difference with Serre’s argument is tha...
متن کامل